feasible point meaning in English
可行点
Examples
- Dual algorithm shows its advantage over other algorithms for its non - need for finding initial feasible point . 4
由于该算法不需要寻找初始可行点，因此比可行方向法和其他需要初始可行点的算法具有更大的吸引力 - Then we propose the problems that will be discussed in the following papers . also , we introduce the theory in the field of feasible region for semi - infinite programming , and concluded that in some area around the feasible points , feasible region can be expressed by finite inequality constraints , this results gives a base to the following algorithms
接着介绍了半无限规划可行域的结构和稳定点的稳定性，指出了关于可行域结构理论研究的现状，并指出在一定的条件下，在可行点的局部邻域内，可行域可以有有限个不等式约束来表示，这为第二、三章半无限规划问题的算法提供了理论基础。 - But j . v . outrata , m . kocvara , et . al . pointed out in 1998 that the equivalent ssnp did n ' t satisfy the weaker mangasarian - fromotitz constraint qualification in any feasible points . so it will be very difficult to get the solution of lcp by means of existing methods for ssnp such as sequential quadratic programming ( sqp for short ) type algorithms , sequential systems of linear equations ( ssle for short ) type algorithms
Kocvara等人在1998年指出了等价的ssnp在任何可行点处都不满足比较弱的mangasarian - fromotitz约束规格，因此，通过用已有的求解ssnp的一些方法如序列二次规划(简记为sqp )类算法、序列线性方程组(简记为ssle )类算法解等价的ssnp来获得线性互补约束问题的解，会有相当的困难